全文获取类型
收费全文 | 6177篇 |
免费 | 600篇 |
国内免费 | 554篇 |
专业分类
化学 | 425篇 |
晶体学 | 5篇 |
力学 | 406篇 |
综合类 | 110篇 |
数学 | 4618篇 |
物理学 | 1767篇 |
出版年
2023年 | 53篇 |
2022年 | 61篇 |
2021年 | 86篇 |
2020年 | 116篇 |
2019年 | 131篇 |
2018年 | 117篇 |
2017年 | 140篇 |
2016年 | 168篇 |
2015年 | 130篇 |
2014年 | 229篇 |
2013年 | 507篇 |
2012年 | 296篇 |
2011年 | 350篇 |
2010年 | 305篇 |
2009年 | 397篇 |
2008年 | 431篇 |
2007年 | 406篇 |
2006年 | 424篇 |
2005年 | 319篇 |
2004年 | 287篇 |
2003年 | 281篇 |
2002年 | 274篇 |
2001年 | 236篇 |
2000年 | 214篇 |
1999年 | 214篇 |
1998年 | 176篇 |
1997年 | 135篇 |
1996年 | 138篇 |
1995年 | 76篇 |
1994年 | 78篇 |
1993年 | 68篇 |
1992年 | 48篇 |
1991年 | 42篇 |
1990年 | 47篇 |
1989年 | 24篇 |
1988年 | 41篇 |
1987年 | 27篇 |
1986年 | 24篇 |
1985年 | 34篇 |
1984年 | 36篇 |
1983年 | 18篇 |
1982年 | 28篇 |
1981年 | 18篇 |
1980年 | 17篇 |
1979年 | 21篇 |
1978年 | 12篇 |
1977年 | 16篇 |
1976年 | 11篇 |
1974年 | 8篇 |
1970年 | 3篇 |
排序方式: 共有7331条查询结果,搜索用时 710 毫秒
991.
《Journal of computational and graphical statistics》2013,22(3):608-632
The problem of marginal density estimation for a multivariate density function f(x) can be generally stated as a problem of density function estimation for a random vector λ(x) of dimension lower than that of x. In this article, we propose a technique, the so-called continuous Contour Monte Carlo (CCMC) algorithm, for solving this problem. CCMC can be viewed as a continuous version of the contour Monte Carlo (CMC) algorithm recently proposed in the literature. CCMC abandons the use of sample space partitioning and incorporates the techniques of kernel density estimation into its simulations. CCMC is more general than other marginal density estimation algorithms. First, it works for any density functions, even for those having a rugged or unbalanced energy landscape. Second, it works for any transformation λ(x) regardless of the availability of the analytical form of the inverse transformation. In this article, CCMC is applied to estimate the unknown normalizing constant function for a spatial autologistic model, and the estimate is then used in a Bayesian analysis for the spatial autologistic model in place of the true normalizing constant function. Numerical results on the U.S. cancer mortality data indicate that the Bayesian method can produce much more accurate estimates than the MPLE and MCMLE methods for the parameters of the spatial autologistic model. 相似文献
992.
Guido Maione Antonio Punzi 《Mathematical and Computer Modelling of Dynamical Systems: Methods, Tools and Applications in Engineering and Related Sciences》2013,19(3):277-299
In recent years, several research works proposed fractional-order controllers as means to improve the performances of common proportional, integral and derivative controllers. However, the design and tuning methods for these new controllers are still at their infancy. As a contribute for filling this gap, this article proposes a two-step design approach. First, differential evolution determines the fractional integral and derivative actions satisfying the required time-domain performance specifications. Second, particle swarm optimization determines rational approximations of the irrational fractional operators as low-order, stable, minimum-phase transfer functions with poles interlacing zeros. Extensive time- and frequency-domain simulations validate the efficiency of the proposed approach. 相似文献
993.
In telecommunication networks packets are carried from a source s to a destination t on a path that is determined by the underlying routing protocol. Most routing protocols belong to the class of shortest path routing protocols. In such protocols, the network operator assigns a length to each link. A packet going from s to t follows a shortest path according to these lengths. For better protection and efficiency, one wishes to use multiple (shortest) paths between two nodes. Therefore the routing protocol must determine how the traffic from s to t is distributed among the shortest paths. In the protocol called OSPF-ECMP (for Open Shortest Path First-Equal Cost Multiple Path) the traffic incoming at every node is uniformly balanced on all outgoing links that are on shortest paths. In that context, the operator task is to determine the “best” link lengths, toward a goal such as maximizing the network throughput for given link capacities.In this work, we show that the problem of maximizing even a single commodity flow for the OSPF-ECMP protocol cannot be approximated within any constant factor ratio. Besides this main theorem, we derive some positive results which include polynomial-time approximations and an exponential-time exact algorithm. We also prove that despite their weakness, our approximation and exact algorithms are, in a sense, the best possible. 相似文献
994.
随着图像采集设备的发展和对图像分辨率要求的提高,人们对图像处理算法在收敛速度和鲁棒性方面提出了更高的要求.从优化的角度对Chan-Vese模型进行算法上的改进,即将共轭梯度法应用到该模型中,使得新算法有更快的收敛速度.首先,简单介绍了Chan-Vese模型的变分水平集方法的理论框架;其次,将共轭梯度算法引入到该模型的求解,得到了模型的新的数值解方法;最后,将得到的算法与传统求解Chan-Vese模型的最速下降法进行了比较.数值实验表明,提出的共轭梯度算法在保持精度的前提下有更快的收敛速度. 相似文献
995.
Kenneth S. Berenhaut Bennett J. Stancil Jonathan H. Newman 《Journal of Difference Equations and Applications》2013,19(7):729-733
This paper studies solutions of some piecewise-linear difference equations. In two particular cases, a descent argument is used to show that all solutions are periodic with either prime period 3(2 k ? 1) or 6(2 k ? 1) for some k ≥ 1. The existence of solutions with such periods is also considered. 相似文献
996.
997.
998.
提出了一种用于多维函数逼近的进化策略修正泛函网络基函数系数的新算法,并给出了其算法学习过程.利用进化策略的自适应性来确定基函数前的系数,改进了泛函网络的参数通过解方程组来得到这一传统方法.仿真结果表明,这种新的逼近算法简单可行,能够逼近给定的函数到预先给定的精度,具有较快的收敛速度和良好的逼近性能. 相似文献
999.
Yanping Chen Luoping Chen Xiaochun Zhang 《Numerical Methods for Partial Differential Equations》2013,29(4):1238-1256
In this article, we develop a two‐grid algorithm for nonlinear reaction diffusion equation (with nonlinear compressibility coefficient) discretized by expanded mixed finite element method. The key point is to use two‐grid scheme to linearize the nonlinear term in the equations. The main procedure of the algorithm is solving a small‐scaled nonlinear equations on the coarse grid and dealing with a linearized system on the fine space using the Newton iteration with the coarse grid solution. Error estimation to the expanded mixed finite element solution is analyzed in detail. We also show that two‐grid solution achieves the same accuracy as long as the mesh sizes satisfy H = O(h1/2). Two numerical experiments are given to verify the effectiveness of the algorithm. © 2012 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013 相似文献
1000.